A New Routing Algorithm for Differentiated Reliable Services with Dynamic Link Availability in WDM Mesh Networks

We address the problem of routing and wavelength assignment (RWA) considering differentiated reliability (DiR) in WDM mesh networks. The backup resource can be shared by the primary lightpaths. However, both the primary-backup sharing and the different levels of fault tolerance requirement have never been considered together in the literature. In the paper, we consider the dynamic character of the link availability, which is caused by primary-backup sharing. Moreover, the priority of traffic is considered in the paper. The paper focuses on routing under dynamic availability of wavelength resource while the requested reliability of traffic has to be met, using the modified shortest path algorithm. A layered availability model is established based on wavelength layered graph model. Using this model, we propose a new algorithm called dynamic layered availability (DLA) algorithm. We evaluate the performance of the proposed algorithm on the NSFNET. key words: differentiated reliability, availability, layered graph, primary and backup sharing